Genetic Algorithm Based Hybrid Approach to Solve Multi-Objective Assignment Problem

Assignment problem (AP) deals with the allocations of n-tasks to n-resources into a pattern in such way that the total decision parameter can be optimized. An assignment problem may appear as an optimizat ion problem with a mult iple objectives. In multi-objective assignment problem (MOAP), an important research concern with the study of efficient solution. In MOAP, the set of efficient solutions can be very large; many of them are not worth to be determined. So in this paper, we present a solution procedure of multi-object ive assignment problem using genetic algorithm based hybrid approach. The developed hybrid approach also shows that the influences of the convergence to efficient solution of MOAP of when different weights are given by decision maker (DM).